翻訳と辞書
Words near each other
・ Logical determinism
・ Logical disjunction
・ Logical disk
・ Logical Disk Manager
・ Logical effort
・ Logical equality
・ Logical equivalence
・ Logical equivalent
・ Logical extreme
・ Logical Form
・ Logical form
・ Logical framework
・ Logical framework approach
・ Logical functor
・ Logical graph
Logical harmony
・ Logical hexagon
・ Logical holism
・ Logical Information Machines
・ Logical Investigations
・ Logical Investigations (Husserl)
・ Logical line of operation
・ Logical link control
・ Logical machine
・ Logical matrix
・ Logical Methods in Computer Science
・ Logical model
・ Logical NOR
・ Logical order of God's decrees
・ Logical partition


Dictionary Lists
翻訳と辞書 辞書検索 [ 開発暫定版 ]
スポンサード リンク

Logical harmony : ウィキペディア英語版
Logical harmony
Logical harmony, a name coined by Sir Michael Dummett, is a supposed constraint on the rules of inference that can be used in a given logical system.
The logician Gerhard Gentzen proposed that the meanings of logical connectives could be given by the rules for introducing them into discourse. For example, if one believes that ''the sky is blue'' and one also believes that ''grass is green'', then one can introduce the connective ''and'' as follows: ''The sky is blue AND grass is green.'' Gentzen's idea was that having rules like this is what gives meaning to one's words, or at least to certain words. The idea has also been associated with Wittgenstein's dictum that in many cases we can say, the meaning is the use. Most contemporary logicians prefer to think that the introduction rules and the elimination rules for an expression are equally important. In this case, ''and'' is characterized by the following rules:
|
|}
An apparent problem with this was pointed out by Arthur Prior: Why can't we have an expression (call it "tonk") whose introduction rule is that of OR (from "p" to "p tonk q") but whose elimination rule is that of AND (from "p tonk q" to "q")? This lets us deduce anything at all from any starting point. Prior suggested that this meant that inferential rules could ''not'' determine meaning. He was answered by Nuel Belnap, that even though introduction and elimination rules can constitute meaning, not just any pair of such rules will determine a meaningful expression – they must meet certain constraints, such as not allowing us to deduce any new truths in the old vocabulary. These constraints are what Dummett was referring to.
Harmony, then, refers to certain constraints that a proof theory must let hold between introduction and elimination rules for it to be meaningful, or in other words, for its inference rules to be meaning-constituting.
The application of harmony to logic may be considered a special case; it makes sense to talk of harmony with respect to not only inferential systems, but also conceptual systems in human cognition, and to type systems in programming languages.
Semantics of this form has not provided a very great challenge to that sketched in Tarski's Semantic theory of truth, but many philosophers interested in reconstituting the semantics of logic in a way that respects Ludwig Wittgenstein's ''meaning is use'' have felt that harmony holds the key.
==References==

*Prior, Arthur. "The runabout inference ticket." ''Analysis'', 21, pp38–39, 1960-61.
*Belnap, Nuel D. Jr. "Tonk, Plonk, and Plink", ''Analysis'', 22, pp130–134, 1961-62.

抄文引用元・出典: フリー百科事典『 ウィキペディア(Wikipedia)
ウィキペディアで「Logical harmony」の詳細全文を読む



スポンサード リンク
翻訳と辞書 : 翻訳のためのインターネットリソース

Copyright(C) kotoba.ne.jp 1997-2016. All Rights Reserved.